1695. Maximum Erasure Value.go

package leetcode

funcmaximumUniqueSubarray(nums []int) int {
iflen(nums) ==0 {
return0
 }
result, left, right, freq:=0, 0, -1, map[int]int{}
forleft<len(nums) {
ifright+1<len(nums) &&freq[nums[right+1]] ==0 {
freq[nums[right+1]]++
right++
 } else {
freq[nums[left]]--
left++
 }
sum:=0
fori:=left; i<=right; i++ {
sum+=nums[i]
 }
result=max(result, sum)
 }
returnresult
}

funcmax(aint, bint) int {
ifa>b {
returna
 }
returnb
}